Some New Properties of Transfinite Ordinals
نویسنده
چکیده
1 Presented to the Society, December 27, 1939. The author is indebted to Professor W. A. Hurwitz for his indispensable advice in the preparation of this paper. 2 W. Sierpinski, Leçons sur les Nombres Transfinis, Paris, 1928, p. 202; hereafter referred to as Sierpinski (I). The theorem was first stated for ordinals of the first and second ordinal class by G. Cantor, Beitrdge zur Begründung der transfiniten Mengenlehre, Mathematische Annalen, vol. 49 (1897), p. 237, and for all ordinals by G. Hessenberg, Grundbegriffe der Mengenlehre, Abhandlungen der Fries'schen Schule, New Series 1.4, Göttingen, 1906, p. 587. 3 W. Sierpinski, A property of ordinal numbers, Bulletin of the Calcutta Mathematical Society, vol. 20 (1930), pp. 21-22; hereafter referred to as Sierpinski (II). 4 A set of ordinal numbers is said to be closed if it contains the least upper bound of each subset. 5 F . Siecza, Sur Vunicité de la décomposition de nombres ordinaux en facteurs irréductibles, Fundamenta Mathematicae, vol. 5 (1924), pp. 172-175.
منابع مشابه
Derived Topologies on Ordinals and Stationary Reflection
We study the transfinite sequence of topologies on the ordinal numbers that is obtained through successive closure under Cantor’s derivative operator on sets of ordinals, starting form the usual interval topology. We characterize the non-isolated points in the ξ-th topology as those ordinals that satisfy a strong iterated form of stationary reflection, which we call ξ-simultaneous-reflection. W...
متن کاملUsing Transfinite Ordinal Conditional Functions
Ordinal Conditional Functions (OCFs) are one of the predominant frameworks to define belief change operators. In his original paper Spohn defines OCFs as functions from the set of worlds to the set of ordinals. But in subsequent paper by Spohn and others, OCFs are just used as functions from the set of worlds to natural numbers (plus eventually +∞). The use of transfinite ordinals in this frame...
متن کاملThe Transfinite Action of 1 Tape Turing Machines
• We produce a classification of the pointclasses of sets of reals produced by infinite time turing machines with 1-tape. The reason for choosing this formalism is that it apparently yields a smoother classification of classes defined by algorithms that halt at limit ordinals. • We consider some relations of such classes with other similar notions, such as arithmetical quasi-inductive definitio...
متن کاملSur les fonctions ordinales conditionnelles transfinies
Ordinal Conditional Functions (OCFs) are one of the predominant frameworks to define belief change operators. In his original paper Spohn defines OCFs as functions from the set of worlds to the set of ordinals. But in subsequent paper by Spohn and others, OCFs are just used as functions from the set of worlds to natural numbers (plus eventually +∞). The use of transfinite ordinals in this frame...
متن کاملTransfinite Iteration Functionals and Ordinal Arithmetic
Although transfinite iteration functionals have been used in the past to construct ever-larger initial segments of the ordinals ([5],[1]), there appears to be little investigation into the nature of the functionals themselves. In this note, we investigate the relationship between (countable) transfinite iteration and ordinal arithmetic. While there is a nice connection between finite iteration ...
متن کامل